The Blowup in Translating LTL to Deterministic Automata
نویسندگان
چکیده
The translation of LTL formulas to nondeterministic automata involves an exponential blow-up, and so does the translation of nondeterministic automata to deterministic ones. This yields a 2 O(n) upper bound for the translation of LTL to deterministic automata. A lower bound for the translation was studied in [KV05a], which describes a 2 Ω( √ n) lower bound, leaving the problem of the exact blow-up open. In this paper we solve this problem and tighten the lower bound to 2 Ω(n) .
منابع مشابه
Deterministic Automata for the (F, G)-Fragment of LTL
When dealing with linear temporal logic properties in the setting of e.g. games or probabilistic systems, one often needs to express them as deterministic omega-automata. In order to translate LTL to deterministic omega-automata, the traditional approach first translates the formula to a non-deterministic Büchi automaton. Then a determinization procedure such as of Safra is performed yielding a...
متن کاملTranslating Linear Temporal Logic to Deterministic !-Automata1
In this paper, a new algorithm for translating linear time temporal logic (LTL) into deterministic !-automata is presented which circumvents the usual tableau construction. The algorithm is not limited to a special kind of !-automaton. As most decidability problems for !-automata can be reduced to corresponding CTL model checking problems, the presented algorithm can be used to translate LTL pr...
متن کاملOn the (In)Succinctness of Muller Automata
There are several types of finite automata on infinite words, differing in their acceptance conditions. As each type has its own advantages, there is an extensive research on the size blowup involved in translating one automaton type to another. Of special interest is the Muller type, providing the most detailed acceptance condition. It turns out that there is inconsistency and incompleteness i...
متن کاملFrom LTL and Limit-Deterministic Büchi Automata to Deterministic Parity Automata
Controller synthesis for general linear temporal logic (LTL) objectives is a challenging task. The standard approach involves translating the LTL objective into a deterministic parity automaton (DPA) by means of the Safra-Piterman construction. One of the challenges is the size of the DPA, which often grows very fast in practice, and can reach double exponential size in the length of the LTL fo...
متن کاملCo-Büching Them All
We solve the open problems of translating, when possible, all common classes of nondeterministic word automata to deterministic and nondeterministic co-Büchi word automata. The handled classes include Büchi, parity, Rabin, Streett and Muller automata. The translations follow a unified approach and are all asymptotically tight. The problem of translating Büchi automata to equivalent co-Büchi aut...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010